(0) Obligation:
The Runtime Complexity (innermost) of the given
CpxTRS could be proven to be
BOUNDS(1, n^1).
The TRS R consists of the following rules:
active(f(X)) → mark(cons(X, f(g(X))))
active(g(0)) → mark(s(0))
active(g(s(X))) → mark(s(s(g(X))))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(f(X)) → f(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(g(X)) → g(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
f(mark(X)) → mark(f(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
g(mark(X)) → mark(g(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
proper(f(X)) → f(proper(X))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(g(X)) → g(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
f(ok(X)) → ok(f(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
g(ok(X)) → ok(g(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))
Rewrite Strategy: INNERMOST
(1) NestedDefinedSymbolProof (BOTH BOUNDS(ID, ID) transformation)
The following defined symbols can occur below the 0th argument of top: proper, active
The following defined symbols can occur below the 0th argument of proper: proper, active
The following defined symbols can occur below the 0th argument of active: proper, active
Hence, the left-hand sides of the following rules are not basic-reachable and can be removed:
active(f(X)) → mark(cons(X, f(g(X))))
active(g(0)) → mark(s(0))
active(g(s(X))) → mark(s(s(g(X))))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(f(X)) → f(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(g(X)) → g(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
proper(f(X)) → f(proper(X))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(g(X)) → g(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
(2) Obligation:
The Runtime Complexity (innermost) of the given
CpxTRS could be proven to be
BOUNDS(1, n^1).
The TRS R consists of the following rules:
g(ok(X)) → ok(g(X))
top(ok(X)) → top(active(X))
f(mark(X)) → mark(f(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(mark(X1), X2) → mark(sel(X1, X2))
f(ok(X)) → ok(f(X))
g(mark(X)) → mark(g(X))
s(ok(X)) → ok(s(X))
s(mark(X)) → mark(s(X))
proper(0) → ok(0)
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
top(mark(X)) → top(proper(X))
Rewrite Strategy: INNERMOST
(3) CpxTrsMatchBoundsTAProof (EQUIVALENT transformation)
A linear upper bound on the runtime complexity of the TRS R could be shown with a Match-Bound[TAB_LEFTLINEAR,TAB_NONLEFTLINEAR] (for contructor-based start-terms) of 2.
The compatible tree automaton used to show the Match-Boundedness (for constructor-based start-terms) is represented by:
final states : [1, 2, 3, 4, 5, 6, 7]
transitions:
ok0(0) → 0
active0(0) → 0
mark0(0) → 0
00() → 0
g0(0) → 1
top0(0) → 2
f0(0) → 3
cons0(0, 0) → 4
sel0(0, 0) → 5
s0(0) → 6
proper0(0) → 7
g1(0) → 8
ok1(8) → 1
active1(0) → 9
top1(9) → 2
f1(0) → 10
mark1(10) → 3
cons1(0, 0) → 11
ok1(11) → 4
sel1(0, 0) → 12
mark1(12) → 5
f1(0) → 13
ok1(13) → 3
g1(0) → 14
mark1(14) → 1
s1(0) → 15
ok1(15) → 6
s1(0) → 16
mark1(16) → 6
01() → 17
ok1(17) → 7
sel1(0, 0) → 18
ok1(18) → 5
cons1(0, 0) → 19
mark1(19) → 4
proper1(0) → 20
top1(20) → 2
ok1(8) → 8
ok1(8) → 14
mark1(10) → 10
mark1(10) → 13
ok1(11) → 11
ok1(11) → 19
mark1(12) → 12
mark1(12) → 18
ok1(13) → 10
ok1(13) → 13
mark1(14) → 8
mark1(14) → 14
ok1(15) → 15
ok1(15) → 16
mark1(16) → 15
mark1(16) → 16
ok1(17) → 20
ok1(18) → 12
ok1(18) → 18
mark1(19) → 11
mark1(19) → 19
active2(17) → 21
top2(21) → 2
(4) BOUNDS(1, n^1)